package Algorithm.Othes;

import java.util.Arrays;

// https://leetcode-cn.com/problems/richest-customer-wealth/
public class Leetcode1672_最富有客户的资产总量 {
    class Solution {
        public int maximumWealth(int[][] accounts) {
            int maxWealth = Integer.MIN_VALUE;
            for (int[] account : accounts) {
                maxWealth = Math.max(maxWealth, Arrays.stream(account).sum());
            }
            return maxWealth;
        }
    }

}
